Description: 数据结构栈的基本操作，包含进栈出栈的操作，用Ｃ实现-The basic operation of the stack data structure, included into the stack, the stack operation, implemented in C Platform: |
Size: 2048 |
Author:Tom |
Hits:
Description: 对数据结构中栈的描述，包括顺序栈，链栈等-The data structure of the description of the stack, including sequence stack, chain stack, etc
Platform: |
Size: 1024 |
Author:陈伟 |
Hits:
Description: 基于严蔚敏版的数据结构的自己编写的栈和队列的c语言源码-Yan Wei-min version of the data structure to write your own stack and queue c language source code Platform: |
Size: 3072 |
Author:zhongjb |
Hits:
Description: 这是我写的三个数据结构中程序，栈，队列，链表，对学习指针有很好的指导作用。-This is a data structure procedures, three I wrote in the stack, queue, linked list, a very good role in guiding the study of pointer. Platform: |
Size: 3072 |
Author:蔡杰 |
Hits:
Description: 数据结构程序，用于模拟停车场的代码，效率高效无误-Data structure used to simulate the parking lot of the code can be run Platform: |
Size: 8192 |
Author:sun |
Hits:
Description: 数据结构 C语言数组实现双向栈 在两端可删除，可添加元素-Two-way data structure C language array stack at both ends can be deleted, you can add elements Platform: |
Size: 2048 |
Author:ljy |
Hits:
Description: 全面演示了数据结构-栈的六大应用，进制转换，括号匹配，行编辑，迷宫求解，表达式运算，其中包括线性表的实现与使用，字符串的实现与使用，栈的实现与使用-Comprehensive presentation of the data structure- Stack six applications, binary conversion, bracket matching, line editing, maze solving, arithmetic expressions, including linear table implementation and use, implementation and use of the string, the stack implementation and use of Platform: |
Size: 13490176 |
Author:王伟 |
Hits:
Description: 这是一个对算术表达式进行求值的控制台程序，程序主要用了数据结构中的栈的方法思想。先把表达式转化为后缀表达式，然后两对后缀表达式求值。程序可以实现对加、减、乘、除、乘方进行运算，还支持括号-This is an arithmetic expression is evaluated console program, the program mainly used the data structure stack method thought. First expression into postfix expression, and then two pairs postfix expression is evaluated. Programs can be achieved on addition, subtraction, multiplication, division, exponentiation for computing, but also support brackets Platform: |
Size: 17408 |
Author:qiur |
Hits:
Description: 堆和栈的区别
一、预备知识—程序的内存分配
一个由C/C++编译的程序占用的内存分为以下几个部分
1、栈区（stack）— 由编译器自动分配释放 ，存放函数的参数值，局部变量的值等。其
操作方式类似于数据结构中的栈。
2、堆区（heap） — 一般由程序员分配释放， 若程序员不释放，程序结束时可能由OS回
收 。注意它与数据结构中的堆是两回事，分配方式倒是类似于链表，呵呵。
3、全局区（静态区）（static）—，全局变量和静态变量的存储是放在一块的，初始化的
全局变量和静态变量在一块区域， 未初始化的全局变量和未初始化的静态变量在相邻的另
一块区域。 - 程序结束后由系统释放。
4、文字常量区 —常量字符串就是放在这里的。 程序结束后由系统释放
5、程序代码区—存放函数体的二进制代码。
-Difference between heap and stack
A knowledge, preparation- program memory allocation
A C/C++ compiler program memory is divided into the following parts
1, the stack area (stack)- released by the compiler automatically assigned, storage function of parameter values, the value of the local variable, etc. its
Mode of operation is similar to the stack in data structure.
2, heap area (heap)- generally assigned by the programmer to release, if the programmer does not release, at the end of the program may be back by the OS
Closed. Pay attention to it and the heap data structure is different, distribution is similar to the linked list, ha ha.
3, global (static) (static)-, global and static variables stored is placed on a piece of, initialization
Global and static variables in an area, an uninitialized global variables and static variables uninitialized in neighbouring the other
An area.- application by the system after the release.
4, literal constant area- constant string is here Platform: |
Size: 8192 |
Author:星火 |
Hits:
Description: 堆栈实现。堆栈就是这样一种数据结构。它是在内存中开辟一个存储区域，数据一个 顺序地存入（也就是“压入——push”）这个区域之中。有一个地址指针总指向最后一个压入堆栈的数据所在的数据单元，存放这个地址指针的寄存器就叫做堆栈指示器。开始放入数据的单元叫做“栈底”。数据一个一个地存入，这个过程叫做“压栈”。在压栈的过程中，每有一个数据压入堆栈，就放在和前一个单元相连的后面一个单元中，堆栈指示器中的地址自动加1。读取这些数据时，按照堆栈指示器中的地址读取数据，堆栈指示器中的地址数自动减 1。这个过程叫做“弹出pop”。如此就实现了后进先出的原则。-Stack implementation. Stack is such a data structure. It was opened in memory a storage area, the data one by one sequentially deposited (ie " push- push" ) into this area. There is an address pointer always points to the last one where the data is pushed onto the stack data unit, the address pointer stored is called the stack pointer register. Start the data into a unit called the " bottom of the stack." Data stored in one by one, this process is called " push." In the push process, each having a data onto the stack, and the previous one is placed behind the unit is connected to a unit, the stack pointer in the address is automatically incremented by 1. Read the data, in accordance with the address of the stack pointer in the read data, the number of addresses in the stack pointer is decremented by one. This process is called " pop pop" . So to achieve a LIFO principle. Platform: |
Size: 1024 |
Author:诚溜 |
Hits:
Description: Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of objects for Andriod.
Platform: |
Size: 1024 |
Author:xuejeiba |
Hits:
Description: 关于 队列 栈 二叉树等数据结构的经典实验及数据-On the queue stack binary tree data structure of the classic experiments and data Platform: |
Size: 62464 |
Author:刘海 |
Hits:
Description: 运用C语言的数据结构部分，关于栈和队列的学习资料。-Part of the data structure, stacks and queues on learning materials. Platform: |
Size: 7168 |
Author:123 |
Hits:
Search - data structure stack